Maximal Area Triangles in a Convex Polygon
نویسنده
چکیده
In [12], the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect, and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm. Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
منابع مشابه
Algorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملAn algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest area triangle in the triangulation. There exists a dynamic programming algorithm that computes ...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملMinimum Area All-flush Triangles Circumscribing a Convex Polygon
In this paper, we consider the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of n half-planes defined by a given convex polygon. Previously, O(n logn) time algorithms were known which are based on the technique for computing...
متن کاملFinding all Maximal Area Parallelograms in a Convex Polygon
We consider the problem of finding the maximum area parallelogram (MAP) inside a given convex polygon. Our main result is an algorithm for computing the MAP in an n-sided polygon in O(n) time. Achieving this running time requires proving several new structural properties of the MAP. Our algorithm actually computes all the locally maximal area parallelograms (LMAPs). In addition to the algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.04071 شماره
صفحات -
تاریخ انتشار 2017